Real roots of univariate polynomials and straight line programs
نویسندگان
چکیده
We give a new proof of the NP-hardness of deciding the existence of real roots of an integer univariate polynomial encoded by a straight line program based on certain properties of the Tchebychev polynomials. These techniques allow us to prove some new NP-hardness results related to real root approximation for polynomials given by straight line programs.
منابع مشابه
Numerical Computation of Polynomial Roots Using MPSolve Version 2.2
We describe the implementation and the use of the package MPSolve (Multiprecision Polynomial Solver) for the approximation of the roots of a univariate polynomial p(x) = ∑n i=0 aix . The package relies on an algorithm, based on simultaneous approximation techniques, that generates a sequence A1 ⊃ A2 ⊃ . . . ⊃ Ak of nested sets containing the root neighborhood of p(x) (defined by the precision o...
متن کاملPolynomials arising in factoring generalized Vandermonde determinants III : computation of their roots
Determinants of the form Vα(x) = |xj i |, i, j = 1, . . . , N where x = (x1, . . . , xN ) is formed by N distinct points belonging to some interval [a, b] of the real line and the αj are ordered integers α1 > α2 > · · · > αN > 0 are known as generalized Vandermonde determinants. These determinants were considered by Heineman at the end of the 1920s [9]. The paper presents some results concernin...
متن کاملBudan tables of real univariate polynomials
The Budan table of f collects the signs of the iterated derivatives of f . We revisit the classical Budan-Fourier theorem for a univariate real polynomial f and establish a new connectivity property of its Budan table. We use this property to characterize the virtual roots of f (introduced by Gonzalez-Vega, Lombardi, Mahé in 1998); they are continuous functions of the coefficients of f . We als...
متن کاملMaximal Univalent Disks of Real Rational Functions and Hermite-biehler Polynomials
The well-known Hermite-Biehler theorem claims that a univariate monic polynomial s of degree k has all roots in the open upper half-plane if and only if s = p+ iq, where p and q are real polynomials of degree k and k−1 resp. with all real, simple and interlacing roots, and q has a negative leading coefficient. Considering roots of p as cyclically ordered on RP 1 we show that the open disk in CP...
متن کاملAn effective algorithm for quantifier elimination over algebraically closed fields using straight line programs
In this paper we obtain an effective algorithm for quantifier elimination over algebraically closed fields: For every effective infinite integral domain k, closed under the extraction of pth roots when the characteristic p of k is positive, and every prenex formula cp with r blocks of quantifiers involving s polynomials 4,. . , & E k[Xl, . . . , X,] encoded in dense form, there exists a well-pa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Discrete Algorithms
دوره 5 شماره
صفحات -
تاریخ انتشار 2007